Game Semantics for the Lambek-Calculus: Capturing Directionality and the Absence of Structural Rules
نویسندگان
چکیده
In this paper, we propose a game semantics for the (associative) Lambek calculus. Compared to the implicational fragment of intuitionistic propositional calculus, the semantics deals with two features of the logic: absence of structural rules, as well as directionality of implication. We investigate the impact of these variations of the logic on
منابع مشابه
Substructural Logics on Display
Substructural logics are traditionally obtained by dropping some or all of the structural rules from Gentzen’s sequent calculi LK or LJ. It is well known that the usual logical connectives then split into more than one connective. Alternatively, one can start with the (intuitionistic) Lambek calculus, which contains these multiple connectives, and obtain numerous logics like: exponential-free l...
متن کاملLambek Calculus Proofs and Tree Automata
We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus cannot be accepted by a finite tree automaton. The proof is extended to cover the proofs used by grammars based on the Lambek calculus, which typically use only a subset of the set of all proofs. While Lambek grammars can assign...
متن کاملRelational Semantics for the Lambek-Grishin Calculus
We study ternary relational semantics for symmetric versions of the Lambek calculus with interaction principles due to Grishin (1983). We obtain completeness on the basis of a Henkin-style weak filter construction. 1 Background, motivation The categorial calculi proposed by Lambek and their current typelogical extensions respect an “intuitionistic” restriction: in a Gentzen presentation, Lambek...
متن کاملAlgorithms for Generation in Lambek Theorem Proving
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This strategy can be modeled by means of rules in the calculus that are geared to generation, or by means of an algorithm for the Theorem Prover. The latter possibility enables processing of a bidirectional calculus. Therefore ...
متن کاملMeeting a Modality? Restricted Permutation for the Lambek Calculus
This paper contributes to the theory of hybrid substructural logics, i.e. weak logics given by a Gentzen-style proof theory in which there are constraints on the application of some structural rules. In particular, we address the question how to add an operator to the Lambek Calculus in order to give it a restricted access to the rule of Permutation, an extension which is partly motivated by li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 90 شماره
صفحات -
تاریخ انتشار 2008